Minimal critical sets for some small Latin squares
نویسنده
چکیده
A general algorithm for finding a minimal critical set for any latin square is presented. By implementing this algorithm, minimal critical sets for all the latin squares of order six have been found. In addition, this algorithm is used to prove that the size of the minimal critical set for a back circulant latin square of order seven is twelve, and for order nine is twenty. These results provide further support for the conjecture that the back circulant latin square of odd order n has minimal critical set of size (n 2 1)/4.
منابع مشابه
A new bound on the size of the largest 2-critical set in a latin square
A critical set is a partial latin square that has a unique completion to a latin square of the same order, and is minimal in this property. If P is a critical set in a latin square L, then each element of P must be contained in a latin trade Q in L such that |P ∩ Q| = 1. In the case where each element of P is contained in an intercalate (latin trade of size 4) Q such that |P∩Q| = 1 we say that ...
متن کاملLatin squares and critical sets of minimal size
IsotoIHsl:n that lower bounds for infinite N of order n. hand or computer, strong critical sets of minimum nOn-lS01110Tnitnc reduced latin squares of order less than or of order 6. These latin squares have been taken from 129 onwards. We summarise our results in Table the numbering system listed by Denes and Keedwell latin squares. This numbering system is based on the ,<:n,,-r1i',rrHl1<:rn cla...
متن کاملSteiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decomposed into six disjoint latin interchanges. 1 Background information In any combinatorial configuration it is possible to identify a subset which uniquely determines the structure of the configuration and in some cases i...
متن کاملA census of critical sets in the Latin squares of order at most six
A critical set in a Latin square of order n is a set of entries in a Latin square which can be embedded in precisely one Latin square of order n. Also, if any element of the critical set is deleted, the remaining set can be embedded in more than one Latin square of order n. In this paper we find all the critical sets of different sizes in the Latin squares of order at most six. We count the num...
متن کاملCritical sets in orthogonal arrays with 7 and 9 levels
To date very few results are known on the critical sets for a set of Mutually Orthogonal Latin Squares(MOLS). In this paper, we consider Orthogonal Array OA(n, k + 2, n, 2) constructed from k mutually orthogonal cyclic latin squares of order n and obtain bounds on the possible sizes of the minimal critical sets. In particular, for n = 7 we exhibit a critical set, thereby improving the bound rep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 17 شماره
صفحات -
تاریخ انتشار 1998